Learning Boxes in High Dimension

ثبت نشده
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning unions of high-dimensional boxes over the reals

In [4] an algorithm is presented that exactly learns (using membership queries and equivalence queries) several classes of unions of boxes in high dimension over finite discrete domains. The running time of the algorithm is polynomial in the logarithm of the size of the domain and other parameters of the target function (in particular, the dimension). We go one step further and present a PAC+MQ...

متن کامل

Learning Boxes in High Dimension 1

We present exact learning algorithms that learn several classes of (discrete) boxes in f0; : : : ; ` 1gn. In particular we learn: (1) The class of unions of O(log n) boxes in time poly(n; log `) (solving an open problem of [16, 12]; in [3] this class is shown to be learnable in time poly(n; `)). (2) The class of unions of disjoint boxes in time poly(n; t; log `), where t is the number of boxes....

متن کامل

Local identification of scalar hybrid models with tree structure

Standard modeling approaches, for example in chemical engineering, suffer from two principal difficulties: the curse of dimension and a lack of extrapolability. We propose an approach via structured hybrid models to resolve both issues. For simplicity we consider reactor models which can be written as a tree-like composition of scalar input-output functions uj. The vertices j of the finite tree...

متن کامل

Transparent Machine Learning Algorithm Offers Useful Prediction Method for Natural Gas Density

Machine-learning algorithms aid predictions for complex systems with multiple influencing variables. However, many neural-network related algorithms behave as black boxes in terms of revealing how the prediction of each data record is performed. This drawback limits their ability to provide detailed insights concerning the workings of the underlying system, or to relate predictions to specific ...

متن کامل

Behavior Analysis of Fractal Features for Texture Description in Digital Images: An Experimental Study

Our Goal • Found that Fractal Features effectively have texture recognition ability using statistical, soft computing, data mining and machine learning methods. • Six texture descriptors introduced in [Chaudhuri and Sarkar, 95] are based on the Fractal Dimension of the original and derived images. The studied features were the FDs of: • the original image (F_1), • the high gray-valued image (F_...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997